Lecture 2 : Approximating Matrix Multiplication
نویسنده
چکیده
Approximating the product of two matrices with random sampling or random projection methods is a fundamental operation that is of interest in and of itself as well as since it is used in a critical way as a primitive for many RandNLA algorithms. In this class, we will introduce a basic algorithm; and in this and the next few classes, we will discusses several related methods. Here is the reading for today.
منابع مشابه
Lecture 4 : Concentration and Matrix Multiplication
Today, we will continue with our discussion of scalar and matrix concentration, with a discussion of the matrix analogues of Markov’s, Chebychev’s, and Chernoff’s Inequalities. Then, we will return to bounding the error for our approximating matrix multiplication algorithm. We will start with using Hoeffding-Azuma bounds from last class to get improved Frobenius norm bounds, and then (next time...
متن کاملSketching Algorithms for Big Data Fall 2017 Lecture 11 — October 5 , 2017
2 Matrix Multiplication Suppose we have two matrices A ∈ Rn×d, B ∈ Rn×p, written as: A = | · · · | a1 · · · an | · · · | , B = −b T 1− .. −bn− where ai ∈ Rd, bi ∈ Rp. We want to compute ATB. The naive approach for doing this requires O(ndp) for loops. There are some faster algorithms. For square matrix multiplication, the following algorithms are of less complexity O(ω): 1. ω < log2 ...
متن کامل3 . 2 Real Dimension Switching
In this lecture we will see a fuller development of the LWE based homomorphic encryption scheme. The multiplication operation in the naive LWE− HE scheme changes the form of the cipher text. In this lecture we see a dimensionality reduction trick to restore the form of the original ciphertext. Finally we conclude with reductions between LWE assumptions that relax the constraints on the probabil...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملMatrix Multiplication I
These notes are based on a lecture given at the Toronto Student Seminar on February 2, 2012. The material is taken mostly from the book Algebraic Complexity Theory [ACT] and the lecture notes by Bläser and Bendun [Blä]. Starred sections are the ones I didn't have time to cover. This lecture discusses the problem of multiplying two square matrices. We will be working in the algebraic complexity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015